Progressive scattered data filtering

Progressive Scattered Data Filtering

Given a finite point set Z ⊂ R, the covering radius of a nonempty subset X ⊂ Z is the minimum distance rX,Z such that every point in Z is at a distance of at most rX,Z from some point in X. This paper concerns the construction of a sequence of subsets of decreasing sizes, such that their covering radii are small. To this end, a method for progressive data reduction, referred to as scattered dat...

Hierarchical Scattered Data Filtering for Multilevel Interpolation Schemes

Scattered data approximation of fully fuzzy data by quasi-interpolation

Fuzzy quasi-interpolations help to reduce the complexity of solving a linear system of equations compared with fuzzy interpolations. Almost all fuzzy quasi-interpolations are focused on the form of $widetilde{f}^{*}:mathbb{R}rightarrow F(mathbb{R})$ or $widetilde{f}^{*}:F(mathbb{R})rightarrow mathbb{R}$.  In this paper, we intend to offer a novel fuzzy radial basis function by the concept of so...

Progressive Gaussian Filtering

In this paper, we propose a progressive Bayesian procedure, where the measurement information is continuously included into the given prior estimate (although we perform observations at discrete time steps). The key idea is to derive a system of ordinary first-order differential equations (ODE) by employing a new coupled density representation comprising a Gaussian density and its Dirac Mixture...

Convex Preserving Scattered Data

We use bivariate C 1 cubic splines to deal with convexity preserving scattered data interpolation problem. Using a necessary and suucient condition on Bernstein-B ezier polynomials, we set the convexity preserving interpolation problem into a quadratically constraint quadratic programming problem. We show the existence of convexity preserving interpolatory surfaces under certain conditions on t...